CoinTossX: An open-source low-latency high-throughput matching engine

نویسندگان

چکیده

We deploy and demonstrate the CoinTossX low-latency, high-throughput, open-source matching engine with orders sent using Julia Python languages. show how this can be deployed for small-scale local desk-top testing discuss a larger scale, but hosting, multiple traded instruments managed concurrently by clients. then cloud based deployment Microsoft Azure, large-scale industrial simulation research use cases in mind. The system is exposed interacted via sockets UDP SBE message protocols monitored simple web browser interface HTTP. give examples showing to market data feeds developed Java submitted as binary encodings (SBE) Aeron Media Driver high throughput transport. separates order-generation environments e.g. agent-based model simulation, from of orders, data-feeds various modularised components order-book system. This ensures more natural realistic asynchronicity between events generating associated dynamics data-feeds. promote preferred order submission environment.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch

This paper focuses on two desired properties of cell-based switches for digital data networks: (1) data cells should not be detained inside the switch any longer than necessary (the work-conserving property) and (2) data cells that have been in the switch longer (older cells) should have priority over younger cells (the order-conserving property). A well-known, but expensive design of a workand...

متن کامل

Designing a DHT for Low Latency and High Throughput

Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including iterative routing, recursive routing, proximity routing and neighbor selection, erasure coding, replication, and server selection. This paper explores the design of these techniques and their interaction i...

متن کامل

SlickDeque: High Throughput and Low Latency Incremental Sliding-Window Aggregation

Online analytics, in most advanced scientific and business applications, rely heavily on the efficient execution of large numbers of Aggregate Continuous Queries (ACQs). Incremental slidingwindow computation is used in the state-of-the-art ACQ processing algorithms (FlatFIT, TwoStacks, and DABA) to avoid the reevaluation of the aggregate value of the window from scratch on every update. FlatFIT...

متن کامل

Self-tuning buffers: achieve both low latency and high throughput

Communications between nodes in a distributed system often fall into one of two camps: they either require low latency, or they are bulk transfers requiring high throughput. This poses a dilemma for the systems designer, since trade-offs which favour low latency often result in poor throughput (and vice versa). For example, deep buffering allows maximum utilisation of network links, but adds la...

متن کامل

OrChem: an open source chemistry search engine for Oracle

BACKGROUND Registration, indexing and searching of chemical structures in relational databases is one of the core areas of cheminformatics. However, little detail has been published on the inner workings of search engines and their development has been mostly closed-source. We decided to develop an open source chemistry extension for Oracle, the de facto database platform in the commercial worl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SoftwareX

سال: 2022

ISSN: ['2352-7110']

DOI: https://doi.org/10.1016/j.softx.2022.101136